翻訳と辞書 |
Alternating-time Temporal Logic : ウィキペディア英語版 | Alternating-time Temporal Logic In computer science, Alternating-time Temporal Logic, or ATL, is a branching-time temporal logic that naturally describes computations of multi-agent system and multiplayer games.〔"Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science" by Govert van Drimmelen, IEEE Computer Society Washington, DC, USA〕 It offers selective quantification over program-paths that are possible outcomes of games.〔"Alternating-time Temporal Logic" by Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, Department of Computer and Information Science, University of Pennsylvania, Philadelphia, PA 19104〕 ATL uses alternating-time formulas to construct model-checkers in order to address problems such as receptiveness, realizability, and controllability. ==See also==
* Computation tree logic * Temporal logic * Linear temporal logic
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Alternating-time Temporal Logic」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|